How to Find an Iceberg’s Breaking Point

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

P14: How to Find a Talent?

Talents may be artistic or technical, mental or physical, personal or social. You can be a talented introvert or a talented extrovert. Learning to look for your talents in the right places and building those talents into skills and abilities might take some work, but going about it creatively will let you explore your natural abilities and find your innate talents. You’re not going to fin...

متن کامل

How to Find the Qcd Critical Point

The event-by-event fluctuations in heavy ion collisions carry information about the thermodynamic properties of the hadronic system at the time of freeze-out. By studying these fluctuations as a function of varying control parameters, such as the collision energy, it is possible to learn much about the phase diagram of QCD. As a timely example, we stress the methods by which present experiments...

متن کامل

How to Find a Fixed Point in Shuffle Efficiently

In electronic voting or whistle blowing, anonymity is necessary. Shuffling is a network security technique that makes the information sender anonymous. We use the concept of shuffling in internet-based lotteries, mental poker, E-commerce systems, and Mix-Net. However, if the shuffling is unjust, the anonymity, privacy, or fairness may be compromised. In this paper, we propose the method for con...

متن کامل

How many mistakes, how to find them.

The topic of quality control often evokes prolific discussion among those whose business is its administration. Reliable methods for identifying mistakes must be developed in both the manufacture and use of test devices. Unit test devices are uncomplicated to run and provide quick results in a world where speed and simplicity are paramount, yet their very nature as individual assay units introd...

متن کامل

How to find frequent patterns?

An improved version of DF , the depth first implementation of Apriori as devised in [7], is presented. Given a database of (e.g., supermarket) transactions, the DF algorithm builds a so-called trie that contains all frequent itemsets, i.e., all itemsets that are contained in at least minsup transactions with minsup a given threshold value. In the trie, there is a one-to-one correspondence betwe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Eos

سال: 2017

ISSN: 2324-9250

DOI: 10.1029/2017eo079621